Using Self-Reducibilities to Characterize Polynomial Time
نویسندگان
چکیده
منابع مشابه
Proofs, Codes, and Polynomial-Time Reducibilities
We show how to construct proof systems for NP languages where a deterministic polynomial-time veriier can check membership, given any N (2=3)+ bits of an N-bit witness of membership. We also provide a slightly super-polynomial time proof system where the veriier can check membership, given only N (1=2)+ bits of an N-bit witness. In addition, we construct proof systems where a deterministic poly...
متن کاملA Comparison of Polynomial Time Reducibilities
&tract. Various forms of polynomial time reducibilig:y zwe compared. Among the forms examined we many-one, bounded truth table, truth 1:able and Turing reducibi!&y. The effect of introducing nondeterminism into red " ,ztiGn procedures is also examined. Computation bounded reducibilities play a role in t theory of' ssralputationa~ complexity which is analogous to, and perhaps as important as, th...
متن کاملStrong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets
GavaldB, R. and J.L. BalcBzar, Strong and robustly strong polynomial time reducibilities to sparse sets, Theoretical Computer Science 88 (1991) I-14. Reducibility defined by oracle strong nondeterministic machines is studied. Two definitions of relativized strength are presented and separated. The corresponding reduction classes of the sparse sets give two nonuniform analogs of the class NPncoN...
متن کاملMinimal Degrees for Honest Polynomial Reducibilities
The existence of minimal degrees is investigated for several polynomial reducibilities. It is shown that no set has minimal degree with respect to polynomial many-one or Turing reducibility. This extends a result. of Ladner [L] whew reciirsive sets are considered. An "honest '' polynomial reducibility, < ; , is defined which is a strengthening of polynomial Turing reduc-ibility. We prove that n...
متن کاملOn the difference between polynomial-time many-one and truth-table reducibilities on distributional problems
In this paper we separate many-one reducibility from truth-table reducibility for distributional problems in DistNP under the hypothesis that P 6 = NP. As a first example we consider the 3-Satisfiability problem (3SAT) with two different distributions on 3CNF formulas. We show that 3SAT using a version of the standard distribution is truth-table reducible but not many-one reducible to 3SAT usin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1993
ISSN: 0890-5401
DOI: 10.1006/inco.1993.1035